Learning Sparse Features with an Auto-Associator

A major issue in statistical machine learning is the design of a representation, or feature space, facilitating the resolution of the learning task at hand. Sparse representations in particular facilitate discriminant learning: On the one hand, they are robust to noise. On the other hand, they disentangle the factors of variation mixed up in dense representations, favoring the separability and interpretation of data. This chapter focuses on auto-associators (AAs), i.e. multi-layer neural networks trained to encode/decode the data and thus de facto defining a feature space. AAs, first investigated in the 80s, were recently reconsidered as building blocks for deep neural networks. This chapter surveys related work about building sparse representations, and presents a new non-linear explicit sparse representation method referred to as Sparse Auto-Associator (SAA), integrating a sparsity objective within the standard auto-associator learning criterion. The comparative empirical validation of SAAs on state-of-art handwritten digit recognition benchmarks shows that SAAs outperform standard auto-associators in terms of classification performance and yield similar results as denoising auto-associators. Furthermore, SAAs enable to control the representation size to some extent, through a conservative pruning of the feature space. Sébastien Rebecchi CNRS, LRI UMR 8623, TAO, INRIA Saclay, Université Paris-Sud 11, F-91405 Orsay, e-mail: [email protected] Hélène Paugam-Moisy CNRS, LIRIS UMR 5205, Université Lumière Lyon 2, F-69676 Bron, e-mail: [email protected] Michèle Sebag CNRS, LRI UMR 8623, TAO, INRIA Saclay, Université Paris-Sud 11, F-91405 Orsay, e-mail: [email protected]